A kleene-like characterization of languages accepted by systolic tree automata
نویسندگان
چکیده
منابع مشابه
Languages Accepted by Integer Weighted Finite Automata
We study the family of languages accepted by the integer weighted nite automata. Especially the closure properties of this family are investigated.
متن کاملSemilinearity and Context-Freeness of Languages Accepted by Valence Automata
Valence automata are a generalization of various models of automata with storage. Here, each edge carries, in addition to an input word, an element of a monoid. A computation is considered valid if multiplying the monoid elements on the visited edges yields the identity element. By choosing suitable monoids, a variety of automata models can be obtained as special valence automata. This work is ...
متن کاملSystolic Tree !-Languages
The class of !-languages recognized by systolic tree automa-ta is introduced. That class extends the class of B uchi !-languages and is closed under boolean operations. The emptiness problem for systolic tree automata on innnite sequences is decidable. A characterization of sys-tolic tree !-languages in terms of a (suitable) concatenation of ((nitary) systolic tree languages is also provided.
متن کاملSingle letter languages accepted by alternating and probabilistic pushdown automata
We consider way k tape alternating pushdown automata k apa and way k tape alternating nite automata k afa We say that an alternating automaton accepts a language L with f n bounded maximal respectively minimal leaf size if arbitrary re spectively at least one accepting tree for any w L has no more than f jwj leaves The main results of the article are the following For way k tape alternating cou...
متن کاملA Logical Characterization of Systolic Languages
In this paper we study, in the framework of mathematical logic, L(SBTA) i.e. the class of languages accepted by Systolic Binary Tree Automata. We set a correspondence (in the style of B uchi Theorem for regular languages) between L(SBTA) and MSOSig], i.e. a decid-able Monadic Second Order logic over a suitable innnite signature Sig. We also introduce a natural subclass of L(SBTA) which still pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1994
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(05)80090-x